More on Combinatorial Batch Codes
نویسندگان
چکیده
Paterson, Stinson and Wei [2] introduced Combinatorial batch codes, which are combinatorial description of Batch code. Batch codes were first presented by Ishai, Kushilevita, Ostrovsky and Sahai [1] in STOC’04. In this paper we answer some of the questions put forward by Paterson, Stinson and Wei and give some results for the general case t > 1 which were not studied by the authors.
منابع مشابه
Optimal combinatorial batch codes based on block designs
Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai, represent the distributed storage of an n-element data set on m servers in such a way that any batch of k data items can be retrieved by reading at most one (or more generally, t) items from each server, while keeping the total storage over m servers equal to N . This paper considers a class of batch codes (for t = 1), called c...
متن کاملCombinatorial batch codes and transversal matroids
Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are n items and m servers each of which stores a subset of the items. It is required that, for prescribed integers k and t, any k items can be retrieved by reading at most t items from each server. Only the case t ...
متن کاملCombinatorial batch codes
In this paper, we study batch codes, which were introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [4]. A batch code specifies a method to distribute a database of n items among m devices (servers) in such a way that any k items can be retrieved by reading at most t items from each of the servers. It is of interest to devise batch codes that minimize the total storage, denoted by N , over...
متن کاملFractional Repetition and Erasure Batch Codes
Batch codes are a family of codes that represent a distributed storage system (DSS) of n nodes so that any batch of t data symbols can be retrieved by reading at most one symbol from each node. Fractional repetition codes are a family of codes for DSS that enable efficient uncoded repairs of failed nodes. In this work these two families of codes are combined to obtain fractional repetition batc...
متن کاملOptimal Fractional Repetition Codes
Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded repair having the minimum repair bandwidth. However, in contrast to minimum bandwidth regenerating codes, where a random set of certain size of available nodes is used for a node repair, the repairs with FR codes are table based. In this work we consider bounds on the fractional repetiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0809.3357 شماره
صفحات -
تاریخ انتشار 2008